Modelling unbounded parallel sessions of security protocols in CSP
نویسنده
چکیده
We show that a simplification to earlier CSP models designed to prove protocols correct on the FDR model checker is valid. This both allows us to extend the scope of our proofs and produce checks that are enormously more efficient.
منابع مشابه
Process algebraic modeling of authentication protocols for analysis of parallel multi-session executions
Many security protocols have the aim of authenticating one agent acting as initiator to another agent acting as responder and vice versa. Sometimes, the authentication fails because of executing several parallel sessions of a protocol, and because an agent may play both the initiator and responder role in parallel sessions. We take advantage of the notion of transition systems to specify authen...
متن کاملTransforming Password Protocols to Compose
Formal, symbolic techniques are extremely useful for modelling and analysing security protocols. They improved our understanding of security protocols, allowed to discover aws, and also provide support for protocol design. However, such analyses usually consider that the protocol is executed in isolation or assume a bounded number of protocol sessions. Hence, no security guarantee is provided w...
متن کاملData independence in the model checking of security protocols
The research presented in this thesis lies in the area of security protocol analysis, focusing mainly on confidentiality and authentication properties. The formal method used is CSP with the model checker FDR. This approach has proved to be very successful for modelling security protocols, especially when it comes to finding attacks (for example [Low95] and [LR97b]). However, since it can only ...
متن کاملDynamic Tags for Security Protocols
The design and verification of cryptographic protocols is a notoriously difficulttask, even in symbolic models which take an abstract view of cryptography. This is mainlydue to the fact that protocols may interact with an arbitrary attacker which yields averification problem that has several sources of unboundedness (size of messages, numberof sessions, etc.).In this paper, ...
متن کاملCasper: A Compiler for the Analysis of Security Protocols
In recent years, a method for analyzing security protocols using the process algebra CSP 8] and its model checker FDR 24] has been developed. This technique has proved remarkably successful, and has been used to discover a number of attacks upon protocols. However, the technique has required producing a CSP description of the protocol by hand; this has proved tedious and error-prone. In this pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005